The bin covering with delivery problem, extended investigations for the online case

Abstract We deal with a model that is called Bin Covering Delivery. Here we search for “good and fast” covering. This problem has been defined investigated recently. continue significantly augment the preliminary investigations of problem. After studying goodness adapted versions some classical algorithms, propose parametrized algorithm use heuristic parameter optimization method to solve this (algorithmically very challenging) Namely, apply local determine good choice parameters. The efficiency proposed demonstrated by intensive computer experiments on appropriate modifications benchmark instances.